Verified eigenvalue and eigenvector computations using complex moments and the Rayleigh–Ritz procedure for generalized Hermitian eigenvalue problems
نویسندگان
چکیده
We propose a verified computation method for eigenvalues in region and the corresponding eigenvectors of generalized Hermitian eigenvalue problems. The proposed uses complex moments to extract eigencomponents interest from random matrix Rayleigh$\unicode{x2013}$Ritz procedure project given problem into reduced problem. moment is by contour integral approximated using numerical quadrature. split error truncation quadrature rounding errors evaluate each. This idea evaluation inherits our previous Hankel approach, whereas enables verification requires half number points approach reduce same order. Moreover, forms transformation that eigenvectors. Numerical experiments show faster than methods while maintaining performance works even nearly singular pencils presence multiple eigenvalues.
منابع مشابه
Hermitian Matrices, Eigenvalue Multiplicities, and Eigenvector Components
Given an n-by-n Hermitian matrix A and a real number λ, index i is said to be Parter (resp. neutral, downer) if the multiplicity of λ as an eigenvalue of A(i) is one more (resp. the same, one less) than that in A. In case the multiplicity of λ in A is at least 2 and the graph of A is a tree, there are always Parter vertices. Our purpose here is to advance the classification of vertices and, in ...
متن کاملA New Inexact Inverse Subspace Iteration for Generalized Eigenvalue Problems
In this paper, we represent an inexact inverse subspace iteration method for computing a few eigenpairs of the generalized eigenvalue problem Ax = Bx [Q. Ye and P. Zhang, Inexact inverse subspace iteration for generalized eigenvalue problems, Linear Algebra and its Application, 434 (2011) 1697-1715 ]. In particular, the linear convergence property of the inverse subspace iteration is preserved.
متن کاملThe Jacobi-Davidson Method for Eigenvalue and Generalized Eigenvalue Problems
We consider variants of Davidson's method for the iterative computation of one or more eigenvalues and their corresponding eigenvectors of an n n matrix A. The original Davidson method 3], for real normal matrices A, may be viewed as an accelerated Gauss-Jacobi method, and the success of the method seems to depend quite heavily on diagonal dominance of A 3, 4, 17]. In the hope to enlarge the sc...
متن کاملNonlinear eigenvalue { eigenvector problems for STP matrices
A matrix A is said to be strictly totally positive (STP) if all its minors are strictly positive. STP matrices were independently introduced by Schoenberg in 1930 (see [13, 14]) and by Krein and Gantmacher in the 1930s. The main results concerning eigenvalues and eigenvectors of STP matrices were proved by Gantmacher and Krein in their 1937 paper [6]. (An announcement appeared in 1935 in [5]. C...
متن کاملChebyshev acceleration techniques for large complex non hermitian eigenvalue problems
The computation of a few eigenvalues and the corresponding eigenvectors of large complex non hermitian matrices arises in many applications in science and engineering such as magnetohydrodynamic or electromagnetism [6], where the eigenvalues of interest often belong to some region of the complex plane. If the size of the matrices is relatively small, then the problem can be solved by the standa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational and Applied Mathematics
سال: 2023
ISSN: ['0377-0427', '1879-1778', '0771-050X']
DOI: https://doi.org/10.1016/j.cam.2022.114994